Coding into K by Reasonable Forcing

9 S ep 1 99 9 Coding into K by reasonable forcing

Global Forcing Number for Maximal Matchings under Graph Operations

Let $S= \{e_1,\,e_2‎, ‎\ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$‎. ‎The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the‎ ‎vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$‎, ‎where $d_i=1$ if $e_i\in M$ and $d_i=0$‎ ‎otherwise‎, ‎for each $i\in\{1,\ldots‎ , ‎k\}$‎. ‎We say $S$ is a global forcing set for maximal matchings of $G$‎ ‎if $...

Forcing notions in inner models

There is a partial order P preserving stationary subsets of !1 and forcing that every partial order in the ground model V that collapses a su ciently large ordinal to !1 over V also collapses !1 over V P. The proof of this uses a coding of reals into ordinals by proper forcing discovered by Justin Moore and a symmetric extension of the universe in which the Axiom of Choice fails. Also, using on...

On the zero forcing number of some Cayley graphs

‎Let Γa be a graph whose each vertex is colored either white or black‎. ‎If u is a black vertex of Γ such that exactly one neighbor‎ ‎v of u is white‎, ‎then u changes the color of v to black‎. ‎A zero forcing set for a Γ graph is a subset of vertices Zsubseteq V(Γ) such that‎ if initially the vertices in Z are colored black and the remaining vertices are colored white‎, ‎then Z changes the col...

Toward a Model for Risks of Change Management Process in Teaching Hospitals

Introduction: Teaching Hospitals are constantly confronted with environmental changes that are forcing them to implement change management. However, there are risks that make this process unsuccessful. Therefore, the purpose of this study was explanation of the model of change management process risks in the teaching hospitals. Methods: This qualitative study was conducted through grounded the...